A CANONICAL RANK-THREE TENSOR MODEL WITH A SCALING CONSTRAINT
نویسندگان
چکیده
منابع مشابه
The Optimization Landscape for Fitting a Rank-2 Tensor with a Rank-1 Tensor∗
The ability to approximate a multivariate function/tensor as a sum of separable functions/tensors is quite useful. Unfortunately, algorithms to do so are not robust and regularly exhibit unpleasantly interesting behavior. A variety of different algorithms have been proposed with different features, but the state of the art is still unsatisfactory. In this work we step back from the algorithms a...
متن کاملThe Optimization Landscape for Fitting a Rank-2 Tensor with a Rank-2 Tensor∗
The ability to approximate a multivariate function/tensor as a sum of separable functions/tensors is quite useful, but algorithms to do so exhibit unpleasantly interesting behavior known as swamps. Such swamps have been the bane of users for decades and need to be understood so they can be alleviated. In previous work, we developed and applied dynamical systems concepts to analyze the simplest ...
متن کاملA New Low-Rank Tensor Model for Video Completion
In this paper, we propose a new low-rank tensor model based on the circulant algebra, namely, twist tensor nuclear norm or t-TNN for short. The twist tensor denotes a 3-way tensor representation to laterally store 2D data slices in order. On one hand, t-TNN convexly relaxes the tensor multi-rank of the twist tensor in the Fourier domain, which allows an efficient computation using FFT. On the o...
متن کاملA Nonlinearly Preconditioned Conjugate Gradient Algorithm for Rank-R Canonical Tensor Approximation
Alternating least squares (ALS) is often considered the workhorse algorithm for computing the rank-R canonical tensor approximation, but for certain problems its convergence can be very slow. The nonlinear conjugate gradient (NCG) method was recently proposed as an alternative to ALS, but the results indicated that NCG is usually not faster than ALS. To improve the convergence speed of NCG, we ...
متن کاملA Mathematical Optimization Model for Solving Minimum Ordering Problem with Constraint Analysis and some Generalizations
In this paper, a mathematical method is proposed to formulate a generalized ordering problem. This model is formed as a linear optimization model in which some variables are binary. The constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. On the one hand, these constraints enforce conditions on an arbitrary subgraph and then g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Modern Physics A
سال: 2013
ISSN: 0217-751X,1793-656X
DOI: 10.1142/s0217751x13500309